Cooperating distributed context-free hexagonal array grammar systems with permitting contexts
نویسندگان
چکیده
In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating the generative power of the resulting systems in the terminal mode. This feature of associating permitting symbols with rules when extended to patterns in the form of connected arrays also requires checking of symbols, but this is simpler than usual pattern matching. The benefit of allowing permitting symbols is that it enables us to reduce the number of components required in a cooperating distributed hexagonal array grammar system for generating a set of picture arrays.
منابع مشابه
Cooperating distributed context-free hexagonal array grammar systems with permitting contexts
In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating the generative power of the resulting systems in the terminal mode. This feature of associating permitting symbols with rules when extended to patterns in the form of connected arrays also requires...
متن کاملCooperating Distributed Grammar Systems with Permitting Grammars as Components
This paper studies cooperating distributed grammar systems working in the terminal derivation mode where the components are variants of permitting grammars. It proves that although the family of permitting languages is strictly included in the family of random context languages, the families of random context languages and languages generated by permitting cooperating distributed grammar system...
متن کاملOn the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components
This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the generative power and that these systems are comp...
متن کاملGeneralized Stream X- machines and Cooperating Distributed Grammar Systems
Stream X-machines are a general and powerful computational model. By coupling the control structure of a stream X-machine with a set of formal grammars a new machine called generalized stream X-machine with underlying distributed grammars, acting as a translator, is obtained. By introducing this new mechanism a hierarchy of computational models is provided. If the grammars are of a particular c...
متن کاملRegulated Finite Index Language Families Collapse
We prove normal form theorems for programmed, ordered, and random context, context-free grammars as well as context-free grammars with regular context conditions of nite index. Based on these normal forms, we reprove that the family of programmed, ordered , permitting, and forbidding random context context-free languages of nite index coincide, regardless whether erasing productions, i.e., rule...
متن کامل